A nonlinearq-voter model with deadlocks on the Watts–Strogatz graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear q-voter model with deadlocks on the Watts-Strogatz graph

We study the nonlinear q-voter model with deadlocks on a Watts-Strogats graph. Using Monte Carlo simulations, we obtain so called exit probability and exit time. We determine how network properties, such as randomness or density of links influence exit properties of a model.

متن کامل

a study on insurer solvency by panel data model: the case of iranian insurance market

the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.

Graph fission in an evolving voter model.

We consider a simplified model of a social network in which individuals have one of two opinions (called 0 and 1) and their opinions and the network connections coevolve. Edges are picked at random. If the two connected individuals hold different opinions then, with probability 1 - α, one imitates the opinion of the other; otherwise (i.e., with probability α), the link between them is broken an...

متن کامل

Voter model on heterogeneous graphs.

We study the voter model on heterogeneous graphs. We exploit the nonconservation of the magnetization to characterize how consensus is reached. For a network of N nodes with an arbitrary but uncorrelated degree distribution, the mean time to reach consensus T(N) scales as Nmu(2)1/mu(2), where mu(k) is the kth moment of the degree distribution. For a power-law degree distribution n(k) approximat...

متن کامل

The Evolving Voter Model on Thick Graphs

In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability 1− α imitate the neighbor but with probability α will sever the connection and choose a new neighbor at random (i) from the graph or (ii) from those with the same opinion. Durrett et al. [7] used simulation and heuristics to study these dynamics on sparse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2014

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2014/07/p07018